Elimination of Malitz Quantifiers in Stable Theories

نویسنده

ANDREAS RAPP

چکیده

The main result of this paper is (a slightly stronger form of) the following theorem: let T be a countable complete first-order theory which is stable. If, for some a > 1, the Malitz quantifier Ql is eliminable in T then all Malitz quantifiers Qg (β > 0, m > 1) are eliminable in T. This complements results of Baldwin-Kueker [1J and Rothmaler-Tuschik [3]. 1. Introduction. In this paper we consider various logics extending first-order logic that are obtained by adding quantifiers asserting the existence of a large homogeneous set of ^-tuples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidability Results for Classes of Ordered Abelian Groups in Logics with Ramsey-quantifiers

This paper is to contributive to the model theory of ordered abelian groups (o.a.g. for short). The basic elements to build up the algebraic structure of the o.a.g-s are the archimedean groups: By Hahn's embedding theorem every o.a.g. can be represented as a subgroup of the Hahn-product of archimedean o.a.g.s. Archimedean is not a first-order concept but there exists a first-order model theory ...

متن کامل

On the elimination of Malitz quantifiers over Archimedian real closed fields

Rapp [5] proves that the theory of the field N of reals in the language with Magidor-Malitz quantifiers Qi, QZ,... is decidable. The quantifier Q] is interpreted in a structure M by: M~Q",xl . . . . ,x,q) iff there exists a set Be=M, card(B)>~% such that for all distinct b 1 . . . . , b ,e B: M ~ q~[b~, ..., b,]; such a set B is called homogeneous for tp. Using Tarski's classical result on real...

متن کامل

Amalgamation and Elimination of Quantifiers for Theories of Fields1

The universal theories of integral domains and of ordered integral domains which have the amalgamation property are characterized via their existentially complete models. The results of A. Macintyre, K. McKenna, and L. van den Dries on fields and ordered fields whose complete theories permit elimination of quantifiers are then derived as easy corollaries. A. Macintyre, K. McKenna, and L. van de...

متن کامل

Abduction in Logic Programming as Second-Order Quantifier Elimination

It is known that skeptical abductive explanations with respect to classical logic can be characterized semantically in a natural way as formulas with second-order quantifiers. Computing explanations is then just elimination of the second-order quantifiers. By using application patterns and generalizations of second-order quantification, like literal projection, the globally weakest sufficient c...

متن کامل